Belief Merging Using Normal Forms
نویسندگان
چکیده
Belief merging aims to conciliate multiple possibly inconsistent belief bases into a consistent common belief base. To handle inconsistency some operators have been proposed. Most of them do not consider inconsistent bases. PS-Merge is an alternative method of merging that uses the notion of Partial Satisfiability and allows us to take into account inconsistent bases. PS-Merge needs the bases represented as DNF formulas, nevertheless, many practical problems are easily represented in its CNF. The aim of this paper is to extend the notion of Partial Satisfiability in order to consider bases represented as CNF formulas. Moreover, we consider Prime Normal forms in order to define a method that allows us to implement PS-Merge for difficult theories. We also show that once the belief bases are represented as sets of normal forms, PS-Merge is polynomial.
منابع مشابه
Prime Normal Forms in Belief Merging
The aim of Belief Merging is to aggregate possibly conflicting pieces of information issued from different sources. The quality of the resulting set is usually considered in terms of a closeness criterion between the resulting belief set and the initial belief sets. The notion of distance between belief sets is thus a crucial issue when we face the merging problem. The aim of this paper is twof...
متن کاملSAT Encodings for Distance-Based Belief Merging Operators
We present SAT encoding schemes for distance-based belief merging operators relying on the (possibly weighted) drastic distance or the Hamming distance between interpretations, and using sum, GMax (leximax) or GMin (leximin) as aggregation function. In order to evaluate these encoding schemes, we generated benchmarks of a time-tabling problem and translated them into belief merging instances. T...
متن کاملDeclarative Belief Set Merging Using Merging Plans
We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are proc...
متن کاملBelief Base Merging as a Game
We propose in this paper a new family of belief merging operators, that is based on a game between sources : until a coherent set of sources is reached, at each round a contest is organized to find out the weakest sources, then those sources has to concede (weaken their point of view). This idea leads to numerous new interesting operators (depending of the exact meaning of “weakest” and “conced...
متن کاملAggregating Judgements by Merging Evidence
The theory of belief revision and merging has recently been applied to judgement aggregation. In this paper I argue that judgements are best aggregated by merging the evidence on which they are based, rather than by directly merging the judgements themselves. This leads to a threestep strategy for judgement aggregation. First, merge the evidence bases of the various agents using some method of ...
متن کامل